Low Latency Allcast Over Broadcast Erasure Channels

Consider $n$ nodes communicating over an unreliable broadcast channel. Each node has a single packet that needs to be communicated all other nodes. Time is slotted, and time slot long enough for each one packet. reaches random subset of The objective minimise the until have received packets. We study two schemes, (i) relaying, (ii) linear network coding, analyse their performance in asymptotic regime which tends infinity. Simulation results wide range are also presented.